Stochastic sequencing with job families, set-up times, and due dates
نویسندگان
چکیده
منابع مشابه
Stochastic Sequencing with Job Families , Setup Times , and Due
We consider the problem of allocating a single server to families of jobs with random service times and due dates. Furthermore, a setup is required when the server switches from one job family to another. We address the problems of minimizing expected weighted ow time, expected maximum lateness, and total weighted tardiness with emphasis on problems for which it is assumed that each family can ...
متن کاملAllocating a Server to Job Families with Set up Times
We consider the problem of allocating a single server to classes of jobs with random service times Each class of jobs possesses a holding cost rate general service distribution and a set up time and designates both a job family and a subtype within the family The set up time is required to e ect a switch from a job of one family to another The objective is to minimize the expected cost due to t...
متن کاملA Flow shop Production Planning Problem with basic period policy and Sequence Dependent set up times
Many authors have examined lot sizing, scheduling and sequence of multi-product flow shops, but most of them have assumed that set up times are independent of sequence. Whereas dependence of set up times to sequence is more common in practice. Hence, in this paper, we examine the discussed problem with hypothesis of dependence of set up times to sequence and cyclic schedule policy in basic peri...
متن کاملA three-stage assembly flow shop scheduling problem with blocking and sequence-dependent set up times
This paper considers a three-stage assembly flowshop scheduling problem with sequence-dependent setup < /div> times at the first stage and blocking times between each stage in such a way that the weighted mean completion time and makespan are minimized. Obtaining an optimal solution for this type of complex, large-sized problem in reasonable computational time using traditiona...
متن کاملSingle-machine scheduling with release dates, due dates and family setup times
We address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and family setup times on a single machine to minimize the maximum lateness. This problem arises from the constant tug-of-war going on in manufacturing between efficient production and delivery performance, between maximizing machine utilization by batching similar jobs and maximizing customers’ satis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Systems Science
سال: 1999
ISSN: 0020-7721,1464-5319
DOI: 10.1080/002077299292524